Special issue on "New trends in Variable Neighborhood Search"

نویسندگان

  • Nenad Mladenovic
  • Angelo Sifaleras
  • Kenneth Sörensen
چکیده

The Variable Neighborhood Search (VNS) metaheuristic is based on systematic changes in the neighborhood structure within a search, and has been succesfully applied for solving various discrete, global optimization problems, and related tasks. This Call for Papers addresses the recently growing interest of the research community working on the VNS methodology. This special issue of the International Transactions in Operational Research (ITOR) is dedicated to contributions on theoretical, methodological, or applied aspects of the VNS metaheuristic. Its objective is to present recent advances in the VNS methodology and novel applications in industrial optimization problems, computer systems, engineering, and other areas. The deadline for submissions is January 15, 2017. Although we strongly encourage authors who attended the 4th International Conference on Variable Neighborhood Search (VNS’16), which was held in Málaga, Spain, October 3–5, 2016, this Call for Papers is also open and welcomes submissions from the entire community of academics and practitioners. Each paper will be peer-reviewed according to the editorial policy of ITOR (http://www3. interscience.wiley.com/journal/118505725/home), published by the International Federation of Operational Research Societies – IFORS. Papers should be original, unpublished, and not currently under consideration for publication elsewhere. They should be prepared according to the instructions to authors that can be found on the journal homepage. Authors should upload their contributions using the submission site http://mc.manuscriptcentral.com/itor, indicating in their cover letter that the paper is intended for this special issue. Other inquiries should be sent directly to any of the Guest Editors in charge of this issue: Nenad Mladenović ([email protected]), Angelo Sifaleras ([email protected]), and Kenneth Sörensen ([email protected]).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An improved memetic algorithm to minimize earliness–tardiness on a single batch processing machine

In this research, a single batch processing machine scheduling problem with minimization of total earliness and tardiness as the objective function is investigated.We first formulate the problem as a mixed integer linear programming model. Since the research problem is shown to be NP-hard, an improved memetic algorithmis proposed to efficiently solve the problem. To further enhance the memetic ...

متن کامل

Editorial to the Special Cluster on Variable Neighborhood Search, Variants and Recent Applications

The Variable Neighborhood Search (VNS) metaheuristic is based on systematic changes in the neighborhood structure within a search. It has been succesfully applied for solving various combinatorial and global optimization problems, and related tasks. The aim of this special cluster of papers in this issue of International Transactions in Operational Research (ITOR) is to gather not only recent a...

متن کامل

Investigating Zone Pricing in a Location-Routing Problem Using a Variable Neighborhood Search Algorithm

In this paper, we assume a firm tries to determine the optimal price, vehicle route and location of the depot in each zone to maximise its profit. Therefore, in this paper zone pricing is studied which contributes to the literature of location-routing problems (LRP). Zone pricing is one of the most important pricing policies that are prevalently used by many companies. The proposed problem is v...

متن کامل

A Combined Stochastic Programming and Robust Optimization Approach for Location-Routing Problem and Solving it via Variable Neighborhood Search algorithm

The location-routing problem is one of the combined problems in the area of supply chain management that simultaneously make decisions related to location of depots and routing of the vehicles. In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve th...

متن کامل

Modeling and scheduling no-idle hybrid flow shop problems

Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically form...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • ITOR

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2017